Mining Trajectory Corridors Using Fréchet Distance and Meshing Grids

ثبت نشده
چکیده

With technology advancement and increasing popularity of location-aware devices, trajectory data are ubiquitous in the real world. Trajectory corridor, as one of the moving patterns, is composed of concatenated subtrajectory clusters which help analyze the behaviors of moving objects. In this paper we adopt a three-phase approach to discover trajectory corridors using Fréchet distance as a dissimilarity measurement. First, trajectories are segmented into sub-trajectories using meshing-grids. In the second phase, a hierarchical method is utilized to cluster intra-grid sub-trajectories for each grid cell. Finally, local clusters in each single grid cell are concatenated to construct trajectory corridors. By utilizing a grid structure, the segmentation and concatenation need only single traversing of trajectories or grid cells. Experiments demonstrate that the unsupervised algorithm correctly discovers trajectory corridors from the real trajectory data. The trajectory corridors using Fréchet distance with temporal information are different from those having only spatial information. By choosing an appropriate grid size, the computing time could be reduced significantly because the number of sub-trajectories in a single grid cell is a dominant factor influencing the speed of the algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mining Trajectory Corridors Using Fréchet Distance and Meshing Grids

With technology advancement and increasing popularity of location-aware devices, trajectory data are ubiquitous in the real world. Trajectory corridor, as one of the moving patterns, is composed of concatenated sub-trajectory clusters which help analyze the behaviors of moving objects. In this paper we adopt a three-phase approach to discover trajectory corridors using Fréchet distance as a dis...

متن کامل

A new conforming mesh generator for three-dimensional discrete fracture networks

Nowadays, numerical modelings play a key role in analyzing hydraulic problems in fractured rock media. The discrete fracture network model is one of the most used numerical models to simulate the geometrical structure of a rock-mass. In such media, discontinuities are considered as discrete paths for fluid flow through the rock-mass while its matrix is assumed impermeable. There are two main pa...

متن کامل

Using Relative Distance and Hausdorff Distance to Mine Trajectory Clusters

Along with development of location service and GPS technology, mining information from trajectory datasets becomes one of hottest research topic in data mining. How to efficiently mine the clusters from trajectories attract more and more researchers. In this paper, a new framework of trajectory clustering, called Trajectory Clustering based Improved Minimum Hausdorff Distance under Translation ...

متن کامل

Fast Hausdorff Trajectory Similarity on Spatial Networks using Virtual Nodes

Given a set of trajectories on a spatial network, the goal of the Network Hausdorff Distance Trajectory Similarity Matrix (NHDTSM) problem is to quickly calculate the commonly used network Hausdorff distance between all pairs of input trajectories. This problem is important to a variety of domains using trajectories, such as transportation services interested in finding primary corridors for pu...

متن کامل

A Segment-Based Trajectory Similarity Measure in the Urban Transportation Systems

With the rapid spread of built-in GPS handheld smart devices, the trajectory data from GPS sensors has grown explosively. Trajectory data has spatio-temporal characteristics and rich information. Using trajectory data processing techniques can mine the patterns of human activities and the moving patterns of vehicles in the intelligent transportation systems. A trajectory similarity measure is o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010